Reformulation and convex relaxation techniques for global optimization
نویسندگان
چکیده
منابع مشابه
Reformulation and convex relaxation techniques for global optimization
We survey the main results obtained by the author in his PhD dissertation supervised by Prof. Costas Pantelides. It was defended at the Imperial College, London. The thesis is written in English and is available from http://or.dhs.org/people/Liberti/phdtesis.ps.gz. The most widely employed deterministic method for the global solution of nonconvex NLPs and MINLPs is the spatial Branch-and-Bound ...
متن کاملGlobal optimization of non-convex generalized disjunctive programs: a review on reformulations and relaxation techniques
In this paper we present a review on the latest advances in logic-based solution methods for the global optimization of non-convex generalized disjunctive programs. Considering that the performance of these methods relies on the quality of the relaxations that can be generated, our focus is on the discussion of a general framework to find strong relaxations. We identify two main sources of non-...
متن کاملReformulation-Linearization Methods for Global Optimization
Discrete and continuous nonconvex programming problems arise in a host of practical applications in the context of production planning and control, location-allocation, distribution, economics and game theory, quantum chemistry, and process and engineering design situations. Several recent advances have been made in the development of branch-and-cut type algorithms for mixed-integer linear and ...
متن کاملUsing quadratic convex reformulation to tighten the convex relaxation of a quadratic program with complementarity constraints
Quadratic Convex Reformulation (QCR) is a technique that has been proposed for binary and mixed integer quadratic programs. In this paper, we extend the QCR method to convex quadratic programs with linear complementarity constraints (QPCCs). Due to the complementarity relationship between the nonnegative variables y and w, a term yDw can be added to the QPCC objective function, where D is a non...
متن کاملConvex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction
1 Convex Relaxation Techniques for Segmentation, Stereo and Multiview Reconstruction 2 1.1 Variational Methods, Partial Differential Equations and Convexity 2 1.2 Image Segmentation and Minimal Partitions 4 1.2.1 Classical Variational Approaches 4 1.2.2 A General Variational Formulation 5 1.2.3 Convex Representation 6 1.2.4 Convex Relaxation 8 1.2.5 Experimental Segmentation Results 9 1.3 Stere...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Quarterly Journal of the Belgian, French and Italian Operations Research Societies
سال: 2004
ISSN: 1619-4500,1614-2411
DOI: 10.1007/s10288-004-0038-6